Scheduling integrated flexible job - shop problem with preventive maintenance to minimize makespan and system unavailability
نویسندگان
چکیده
Integrating flexible job-shop scheduling problem (FJSP) with preventive maintenance (PM) is pondered in this paper. Minimizing the makespan for scheduling part and minimizing the system unavailability for maintenance part are simultaneously under consideration. For doing it, the assignment of n jobs on m machines in production side and executing the PM actions at appropriate time intervals in maintenance part are carried out at the same time. Also, for carrying out the maintenance side, reliability model is employed. Moreover, number of maintenance actions and maintenance intervals are not fixed in advanced. In order to ensure of obtained results, two multi-objective evolutionary algorithms (NSGA-II and NRGA) are compared. Besides, these genetic algorithms were hybridized with both well-known composite dispatching rule (CDR) and active scheduling and then compared as a two new evolutionary algorithms named CDRNSGA-II and CDRNRGA. Furthermore, the algorithms are compared with more than 4800 test instances.
منابع مشابه
An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method
In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملA New model for integrated lot sizing and scheduling in flexible job shop problem
In this paper an integrated lot-sizing and scheduling problem in a flexible job shop environment with machine-capacity-constraint is studied. The main objective is to minimize the total cost which includes the inventory costs, production costs and the costs of machine’s idle times. First, a new mixed integer programming model,with small bucket time approach,based onProportional Lot sizing and S...
متن کامل